package algorithm.graph;

/**
 * @author bingo
 * @Date 2018/3/13
 */
public interface Graph {

    public void addEdge(int v, int w);

    public boolean hasEdge(int v, int w);

    public Iterable<Integer> adj(int v);

    public void show();

    public int n();

    public int m();


}
